Satisfiability threshold for power law random 2-SAT in configuration model
نویسندگان
چکیده
We study Random 2-SAT problem, in which 2-CNFs are sampled from a wide range of non-uniform distributions, including heavy-tailed using random model that is quite different the standard uniform 2-SAT. This SAT so-called configuration model, given by distribution ξ for degree (or number occurrences) each variable. To generate formula variable , generating several clones Then 2-clauses created choosing partitioning into 2-element sets on set and assigning polarity literals at random. Here we consider problem power-law-like distributions . More precisely, assume such its right tail F ( x ) satisfies conditions W ℓ − α ≤ V some constants The main goal to satisfiability threshold phenomenon, show exists determined simple relation between first second moments
منابع مشابه
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT
Propositional satisfiability (SAT) is one of the most fundamental problems in computer science. The worst-case hardness of SAT lies at the core of computational complexity theory. The averagecase analysis of SAT has triggered the development of sophisticated rigorous and non-rigorous techniques for analyzing random structures. Despite a long line of research and substantial progress, nearly all...
متن کاملSatisfiability Threshold of the Skewed Random k-SAT
We consider the satisfiability phase transition in skewed random k-SAT distributions. It is known that the random k-SAT model, in which the instance is a set of m k-clauses selected uniformly from the set of all k-clauses over n variables, has a satisfiability phase transition at a certain clause density. The essential feature of the random k-SAT is that positive and negative literals occur wit...
متن کاملThe satisfiability threshold for random linear equations
Let $A$ be a random $m\times n$ matrix over the finite field $F_q$ with precisely $k$ non-zero entries per row and let $y\in F_q^m$ be a random vector chosen independently of $A$. We identify the threshold $m/n$ up to which the linear system $A x=y$ has a solution with high probability and analyse the geometry of the set of solutions. In the special case $q=2$, known as the random $k$-XORSAT pr...
متن کاملA General Upper Bound for the Satisfiability Threshold of Random r-SAT Formulae
It is well known that the general problem of checking the satissability of a set of clauses is NP-complete. Experimentations have shown that there is a threshold on the ratio \number of clauses/number of variables" that separates the set of clauses for which a solution can be (easily) found from those for which it is impossible to nd a solution. The subject of this talk is the r-SAT problem, in...
متن کاملUPPER BOUND ON THE SATISFIABILITY THRESHOLD OF REGULAR RANDOM (k, s)-SAT PROBLEM
We consider a strictly regular random (k, s)-SAT problem and propose a GSRR model for generating its instances. By applying the first moment method and the asymptotic approximation of the γth coefficient for generating function f(z), where λ and γ are growing at a fixed rate, we obtain a new upper bound 2 log 2−(k+1) log 2/2+ εk for this problem, which is below the best current known upper boun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2021
ISSN: ['1879-2294', '0304-3975']
DOI: https://doi.org/10.1016/j.tcs.2021.07.028